A New Heuristic for the Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.
متن کاملNew Heuristic Rounding Approaches to the Quadratic Assignment Problem
Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the effici...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملA new greedy algorithm for the quadratic assignment problem
The classical greedy algorithm for discrete optimization problems where the optimal solution is a maximal independent subset of a finite ground set of weighted elements, can be defined in two ways which are dual to each other. The Greedy-In where a solution is constructed from the empty set by adding the next best element, one at a time, until we reach infeasibility, and the Greedy-Out where st...
متن کاملMigrating Birds Optimization: A New Meta-heuristic Approach and Its Application to the Quadratic Assignment Problem
A Study on the Mutation Rates of a Genetic Algorithm Interacting with a Sandpile p. 32 On the Design of Boolean Network Robots p. 43 EvoGames Contributions Multiple Tree for Partially Observable Monte-Carlo Tree Search p. 53 Evolving Interesting Maps for a First Person Shooter p. 63 Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo p. 73 Nested Look-Ahead Evolutionary Algorithm Bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Decision Sciences
سال: 2002
ISSN: 1173-9126
DOI: 10.1207/s15327612jamd0603_1